An Evolutionary Algorithm for Graph Coloring Problems
نویسندگان
چکیده
منابع مشابه
An Efficient Evolutionary Algorithm for Strict Strong Graph Coloring Problem
A very promising approach for combinatorial optimization is evolutionary algorithms. As an application, this paper deals with the strict strong graph coloring problem defined by Haddad and Kheddouci (2009) where the authors have proposed an exact polynomial time algorithm for trees. The aim of this paper is to introduce a new evolutionary algorithm for solving this problem for general graphs. I...
متن کاملA practical algorithm for [r, s, t]-coloring of graph
Coloring graphs is one of important and frequently used topics in diverse sciences. In the majority of the articles, it is intended to find a proper bound for vertex coloring, edge coloring or total coloring in the graph. Although it is important to find a proper algorithm for graph coloring, it is hard and time-consuming too. In this paper, a new algorithm for vertex coloring, edge coloring an...
متن کاملSolving Graph Coloring Problems Using Cultural Algorithm
This paper proposes a new method based on the cultural algorithm to solve graph coloring problem (GCP). Graph coloring problem involves finding the minimum number of colors for coloring the graph vertices such that adjacent vertices have distinct colors. In this paper various components of cultural algorithm have been implemented to solve GCP with a self adaptive behavior in an efficient manner...
متن کاملSolving Graph Coloring Problems Using Cultural Algorithm
This paper proposes a new method based on the cultural algorithm to solve graph coloring problem (GCP). Graph coloring problem involves finding the minimum number of colors for coloring the graph vertices such that adjacent vertices have distinct colors. In this paper various components of cultural algorithm have been implemented to solve GCP with a self adaptive behavior in an efficient manner...
متن کاملEvolutionary Graph Coloring
The Graph Coloring Problem (GCP) asks for the minimum number of colors required to color the vertices of a graph such that no two adjacent vertices have the same color. In this thesis we present an evolutionary algorithm for the GCP with novel crossover operations using graph partitioning. Our population contains only legal colorings and we use various greedy coloring algorithms to initialize i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Japan Society for Fuzzy Theory and Systems
سال: 2000
ISSN: 0915-647X,2432-9932
DOI: 10.3156/jfuzzy.12.5_52